The (revised) Szeged index and the Wiener index of a nonbipartite graph
نویسندگان
چکیده
منابع مشابه
A Note on Revised Szeged Index of Graph Operations
Let $G$ be a finite and simple graph with edge set $E(G)$. The revised Szeged index is defined as $Sz^{*}(G)=sum_{e=uvin E(G)}(n_u(e|G)+frac{n_{G}(e)}{2})(n_v(e|G)+frac{n_{G}(e)}{2}),$ where $n_u(e|G)$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$ and $n_{G}(e)$ is the number of equidistant vertices of $e$ in $G$. In this paper...
متن کاملOn the difference between the revised Szeged index and the Wiener index
Let Sz(G) and W (G) be the revised Szeged index and the Wiener index of a graph G. Chen, Li, and Liu [European J. Combin. 36 (2014) 237–246] proved that if G is a non-bipartite connected graph of order n ≥ 4, then Sz(G) −W (G) ≥ ( n + 4n− 6 ) /4. Using a matrix method we prove that if G is a non-bipartite graph of order n, size m, and girth g, then Sz(G)−W (G) ≥ n ( m− 3n 4 ) + P (g), where P i...
متن کاملThe quotients between the (revised) Szeged index and Wiener index of graphs
Let Sz(G), Sz(G) and W (G) be the Szeged index, revised Szeged index and Wiener index of a graph G. In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order n > 10 are characterized; and the graphs with the first, second, third, and fourth largest Wiener indices among all bicyclic graphs are identified. Based on these results...
متن کاملThe Normalized Revised Szeged Index
In chemical graph theory, many graph parameters, or topological indices, were proposed as estimators of molecular structural properties. Often several variants of an index are considered. The aim is to extend the original concept to larger families of graphs than initially considered, or to make it more precise and discriminant, or yet to make its range of values similar to that of another inde...
متن کاملOn the revised edge-Szeged index of graphs
The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2014
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.07.019